Iterated two-phase local search for the Set-Union Knapsack Problem
نویسندگان
چکیده
منابع مشابه
Iterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملIterated responsive threshold search for the quadratic multiple knapsack problem
The quadratic multiple knapsack problem (QMKP) consists in assigning objects with both individual and pairwise profits to a set of limited knapsacks in order to maximize the total profit. QMKP is a NP-hard combinatorial optimization problem with a number of applications. In this paper, we present an iterated responsive threshold search (IRTS) approach for solving the QMKP. Based on a combined u...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملIterated local search for the quadratic assignment problem
Iterated local search (ILS) is a surprisingly simple but at the same time powerful metaheuristic for nding high quality approximate solutions for combinatorial optimization problems. ILS is based on the repeated application of a local search algorithm to initial solution which are obtained by mutations of previously found local optima | in most ILS algorithms these mutations are applied to the ...
متن کاملIterated Local search for the Linear Ordering Problem
This paper addresses the linear ordering problem, which has been solved using different metaheuristics approaches. These algorithms have the common problem of finding a proper balance of the intensification and diversification processes; in this work we propose an iterated local search in which it is incorporated a Becker heuristic strategy for constructing the initial solution, and a search st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Generation Computer Systems
سال: 2019
ISSN: 0167-739X
DOI: 10.1016/j.future.2019.07.062